On the speed of a planar random walk avoiding its past convex hull
نویسندگان
چکیده
منابع مشابه
Dynamic Planar Convex Hull
In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(logn) time per operation. The space usage of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangen...
متن کاملRandom Walks That Avoid Their past Convex Hull
We explore planar random walk conditioned to avoid its past convex hull. We prove that it escapes at a positive lim sup speed. Experimental results show that fluctuations from a limiting direction are on the order of n. This behavior is also observed for the extremal investor, a natural financial model related to the planar walk. Figure 1: 300 steps of the rancher
متن کاملThe Ultimate Planar Convex Hull Algorithm?
We present a new planar convex hull algorithm with worst case time complexity O(n log H) where n is the size of the input set and H is the size of the output set, i.e. the number of vertices found to be on the hull. We also show that this algorithm is asymptotically worst case optimal on a rather realistic model of computation even if the complexity of the problem is measured in terms of input ...
متن کاملOn the convex hull of random points in a polytope
'This research was sponsored by the National Science Foundation under Grant No. ECS-8418392. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of the National Science Foundation or the US Government. On the Convex Hull of Random Points in a Polytope R e x A . D w y e r * ...
متن کاملOn the scaling limit of planar self - avoiding walk
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the scaling limit of the uniform measures on these objects. The conjectures are based on recent results on the stochastic Loewner evolution and nondisconnecting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincare (B) Probability and Statistics
سال: 2005
ISSN: 0246-0203
DOI: 10.1016/j.anihpb.2004.08.001